Ela Diagonal Entry Restrictions in Minimum Rank Matrices
نویسندگان
چکیده
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G). Although no restrictions are applied to the diagonal entries of matrices in S (G), this work explores when the diagonal entries corresponding to specific vertices of G must be zero or nonzero for all matrices A ∈ M R (G). These vertices are denoted as nil or nonzero, respectively. Vertices whose corresponding diagonal entries are not similarily restricted for all matrices in M R (G) are called neutral. The minimum rank of a graph following an edge-subdivision is determined by the existence of a nil vertex, and several relations between diagonal restrictions and the rank-spread parameter are found. This is followed by the rather different approach of using the graph parameter Ẑ to identify nil and nonzero vertices. The nil, nonzero and neutral vertices of trees are classified in terms of rank-spread. Finally, it is shown that except for K3, 2-connected graphs with maximum nullity 2 have all neutral vertices and, moreover, the graphs with maximum nullity 2 that have nil or nonzero vertices are completely classified.
منابع مشابه
Ela Universally Optimal Matrices and Field Independence of the Minimum Rank of a Graph∗
The minimum rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose (i, j)th entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A universally optimal matrix is defined to be an integer matrix A such that every off-diagonal entry of A is 0, 1, or −1, and for all fields F , the rank of A is the minimum rank o...
متن کاملDiagonal entry restrictions in minimum rank matrices
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
متن کاملEla the Inverse Eigenvalue and Inertia Problems for Minimum Rank Two Graphs∗
Abstract. Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let mr(G) denote the minimum rank of all matrices in S(G), and mr+(G) the minimum rank of all positive semidefinite matrices in S(G). All graphs G with mr(G) = 2 and mr+(G) = k are chara...
متن کاملEla Minimum Rank, Maximum Nullity, and Zero Forcing Number of Simple Digraphs
A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity. Cut-vertex reduction formulas for minimum rank and zero forcing number for simpl...
متن کاملEla on the Minimum Rank of Not Necessarily Symmetric Matrices: a Preliminary Study∗
The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...
متن کامل